Maximum induced matching problem on hhd-free graphs
نویسندگان
چکیده
منابع مشابه
Maximum induced matching problem on hhd-free graphs
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is known that finding the size of a MIM in a graph is NP-hard even if the graph is bipartite. It is also known that the size of a MIM in a chordal gr...
متن کاملConvexity and HHD-Free Graphs
It is well known that chordal graphs can be characterized via m-convexity. In this paper we introduce the notion of m-convexity (a relaxation of m-convexity) which is closely related to semisimplicial orderings of graphs. We present new characterizations of HHD-free graphs via m -convexity and obtain some results known from [B. Jamison and S. Olariu, Adv. Appl. Math., 9 (1988), pp. 364–376] as ...
متن کاملMaximum semi-matching problem in bipartite graphs
An (f, g)-semi-matching in a bipartite graph G = (U ∪V,E) is a set of edges M ⊆ E such that each vertex u ∈ U is incident with at most f(u) edges of M , and each vertex v ∈ V is incident with at most g(v) edges of M . In this paper we give an algorithm that for a graph with n vertices and m edges, n ≤ m, constructs a maximum (f, g)semi-matching in running time O(m ·min( √∑ u∈U f(u), √∑ v∈V g(v)...
متن کاملRecognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHDfree, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to dete...
متن کاملSolving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time
The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conject...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.08.027